Uniformly Weighted Star-Factors of Graphs
نویسندگان
چکیده
A star-factor of a graph G is a spanning subgraph of G such that each component is a star. An edge-weighting of G is a function w : E(G) −→ N, where N is the set of positive integers. Let Ω be the family of all graphs G such that every star-factor of G has the same weight under some fixed edge-weighting w. The open problem of characterizing the class Ω, posed by Hartnell and Rall, is motivated by the minimum cost spanning tree and the optimal assignment problems. In this paper, we present a simple structural characterization of the graphs in Ω that have girth at least five.
منابع مشابه
J ul 2 00 7 Uniformly Weighted Star - Factors of Graphs ∗
A star-factor of a graph G is a spanning subgraph of G such that each component of which is a star. An edge-weighting of G is a function w : E(G) −→ N, where N is the set of positive integers. Let Ω be the family of all graphs G such that every star-factor of G has the same weights under a fixed edge-weighting w. In this paper, we present a simple structural characterization of the graphs in Ω ...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملApproximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
This paper studies the algorithmic issues of the spanning star forest problem. We prove the following results: (1) There is a polynomial-time approximation scheme for planar graphs; (2) there is a polynomial-time 3 5 -approximation algorithm for graphs; (3) it is NP-hard to approximate the problem within ratio 259 260 + for graphs; (4) there is a linear-time algorithm to compute the maximum sta...
متن کامل$k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 113 شماره
صفحات -
تاریخ انتشار 2014